REVISED FAST FOURIER TRANSFORM

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integer fast Fourier transform

In this paper, a concept of integer fast Fourier transform (IntFFT) for approximating the discrete Fourier transform is introduced. Unlike the fixed-point fast Fourier transform (FxpFFT), the new transform has the properties that it is an integer-to-integer mapping, is power adaptable and is reversible. The lifting scheme is used to approximate complex multiplications appearing in the FFT latti...

متن کامل

Pipeline Fast Fourier Transform

This paper describes a novel structure for a hardwired fast Fourier transform (FFT) signal processor that promises to permit digital spectrum analysis to achieve throughput rates consistent with extremely wide-band radars. The technique is based on the use of serial storage for data and intermediate results and multiple arithmetic units each of which carries out a sparse Fourier transform. Deta...

متن کامل

CoreFFT Fast Fourier Transform

• Forward and Inverse 32-, 64-, 128-, 256-, 512-, 1,024-, and 2,048-Point Complex FFT • Decimation–In-Time (DIT) Radix-2 Implementation Optimized for Actel FPGAs • Selection of Unconditional or Conditional Block Floating-Point Scaling • Embedded RAM-Block-Based Twiddle Factor Generator • 8to 16-Bit Configurable Input/Output Data and Twiddle Coefficients Precision • Naturally Ordered Input and O...

متن کامل

Fast Quaternionic Fourier Transform

Fast Quaternionic Fourier Transform 1 Acknowledgements I am grateful to all those who contributed to this project, to my professors, especially Gerald Sommer, and other professionals who have taken the time to answer questions and forced me to ask new ones. I particularly appreciate the professional wisdom and assistance of Thomas B ulow, the support in technical details by Udo Mahlmeister and ...

متن کامل

The Fast Fourier Transform

In the next two lectures, we will continue to expand our toolbox for computing in frequency domain, by adding two important computational tools. The first, the Fast Fourier Transform (FFT) is a family of algorithms for efficiently computing the Discrete Fourier Transform. These algorithms are of great practical importance, as theymake it possible to perform frequency domain analysis of very lar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Radio Electronics, Computer Science, Control

سال: 2014

ISSN: 2313-688X,1607-3274

DOI: 10.15588/1607-3274-2015-1-9